Видео с ютуба Leetcode Tree

How to solve (almost) any binary tree coding problem

Диаметр двоичного дерева — Leetcode 543 — Python

Симметричное дерево — Leetcode 101 — Python

Minimum Depth of Binary Tree (LeetCode 111) | Full solution w/ graphical examples | Study Algorithms

Construct Quad Tree - Leetcode 427 - Python

Сбалансированное двоичное дерево — Leetcode 110 — Python

Ultimate Guide to Prefix Trees (Tries) - Leetcode and Interviews

Data Structure and Algorithm Patterns for LeetCode Interviews – Tutorial

Invert Binary Tree - Depth First Search - Leetcode 226

Обход уровня двоичного дерева (BFS) - Leetcode 102

Maximum Depth of Binary Tree - 3 Solutions - Leetcode 104 - Python

Implement Trie (Prefix Tree) - Leetcode 208

Minimum Height Trees - Leetcode 310 - Python

Graph Valid Tree - Leetcode 261 - Python

Same Tree - Leetcode 100 - Python

Construct Binary Tree from Inorder and Preorder Traversal - Leetcode 105 - Python

Поддерево другого дерева — Leetcode 572 — Python

Итеративный и рекурсивный — симметричный обход двоичного дерева — Leetcode 94 — Python

Diameter of Binary Tree - Leetcode 543 - Trees (Python)

Lowest Common Ancestor of a Binary Search Tree - Leetcode 235 - Python